YES 0.41300000000000003 H-Termination proof of /home/matraf/haskell/eval_FullyBlown_Fast/empty.hs
H-Termination of the given Haskell-Program with start terms could successfully be proven:



HASKELL
  ↳ BR

mainModule Main
  ((min :: Bool  ->  Bool  ->  Bool) :: Bool  ->  Bool  ->  Bool)

module Main where
  import qualified Prelude



Replaced joker patterns by fresh variables and removed binding patterns.

↳ HASKELL
  ↳ BR
HASKELL
      ↳ COR

mainModule Main
  ((min :: Bool  ->  Bool  ->  Bool) :: Bool  ->  Bool  ->  Bool)

module Main where
  import qualified Prelude



Cond Reductions:
The following Function with conditions
min x y
 | x <= y
 = x
 | otherwise
 = y

is transformed to
min x y = min2 x y

min1 x y True = x
min1 x y False = min0 x y otherwise

min0 x y True = y

min2 x y = min1 x y (x <= y)

The following Function with conditions
undefined 
 | False
 = undefined

is transformed to
undefined  = undefined1

undefined0 True = undefined

undefined1  = undefined0 False



↳ HASKELL
  ↳ BR
    ↳ HASKELL
      ↳ COR
HASKELL
          ↳ Narrow

mainModule Main
  (min :: Bool  ->  Bool  ->  Bool)

module Main where
  import qualified Prelude



Haskell To QDPs